Structural Design via Semidefinite Programming

نویسندگان

  • Aharon Ben-Tal
  • Arkadi Nemirovski
چکیده

We consider a general problem of Structural Design and demonstrate that under mild assumptions it can be posed as a Semidefinite program. The approach in question allows for unified treatment of single-load/multi-load Truss and Shape design with and without obstacles, same as for obstacle-free robust Truss and Shape design. We present three equivalent Semidefinite formulations of the Structural Design problem, discuss possibilities of their computational processing by interior point methods, same as the techniques for recovering optimal structures from the solutions to the corresponding SDP’s. 1 Structural Design: general setting The problem we are interested in is, in its general setting, as follows. Consider a mechanical construction S with finitely many degrees of freedom M ; thus, virtual displacements of the system are specified by vectors w ∈ RM . The potential energy capacitated by the construction under a displacement w is assumed to be a nonnegative quadratic function 12w TQw of the displacement, Q being a symmetric positive semidefinite matrix characterizing the construction; this matrix is assumed to depend linearly on the vector t of design parameters of the construction: Q = Q(t). We are given also a set W ⊂ RM of kinematically admissible displacements. The construction can be subject to an external load; mathematically, such a load is a vector f ∈ RM . The displacement caused by the load maximizes the function 2f w − wTQ(t)w over w ∈ W ; the corresponding optimal value compl(f ; t) = sup w∈W [ 2f w − wTQ(t)w ] is twice the compliance of the construction under load f ; the less is this compliance, the better are the rigidity properties of the construction with respect to the load. The problem of optimal structural design in its general setting is as follows: given a set F ⊂ RM of tentative loads and a set T of admissible values of the design vector t, we are 1) The research was partly supported by the Israel Science Foundation grant # 306/94-3, by the Fund for the Promotion of Research at Technion and by the G.I.F. contract No. I-0455-214.06/95

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Recurrent Neural Network Model for Solving Linear Semidefinite Programming

In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...

متن کامل

D-optimal Design for Multivariate Polynomial Regression via the Christoffel Function and Semidefinite Relaxations

We present a new approach to the design of D-optimal experiments with multivariate polynomial regressions on compact semi-algebraic design spaces. We apply the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically and approximately the optimal design problem. The geometry of the design is recovered with semidefinite programming duality theory and the Christof...

متن کامل

Interior-point methods for magnitude filter design

ABSTRACT We describe efficient interior-point methods for the design of filters with constraints on the magnitude spectrum, for example, piecewise-constant upper and lower bounds, and arbitrary phase. Several researchers have observed that problems of this type can be solved via convex optimization and spectral factorization. The associated optimization problems are usually solved via linear pr...

متن کامل

Structured semidefinite programs for the control of symmetric systems

In this paper we show how the symmetry present in many linear systems can be exploited to significantly reduce the computational effort required for controller synthesis. This approach may be applied when controller design specifications are expressible via semidefinite programming. In particular, when the overall system description is invariant under unitary coordinate transformations of the s...

متن کامل

Robust Truss Topology Design via Semidefinite Programming

We present and motivate a new model of the truss topology design problem, where the rigidity of the resulting truss with respect both to given loading scenarios and small “occasional” loads is optimized. It is shown that the resulting optimization problem is a semidefinite program. We derive and analyze several equivalent reformulations of the problem and present illustrative numerical examples.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000